Computing connectedness: disconnectedness and discreteness
نویسندگان
چکیده
منابع مشابه
Computing connectedness: disconnectedness and discreteness
We consider finite point-set approximations of a manifold or fractal with the goal of determining topological properties of the underlying set. We use the minimal spanning tree of the finite set of points to compute the number and size of its -connected components. By extrapolating the limiting behavior of these quantities as → 0 we can say whether the underlying set appears to be connected, to...
متن کاملConnectedness and Disconnectedness: a Different Perspective
A factorization of a Galois connection investigated earlier is used to give a definition of a connectedness-disconnectedness Galois connection that is free of the notion of constant morphism. A new notion of N -fixed morphism with respect to a classN of monomorphisms is presented. This is used to characterize the connectedness-disconnectedness Galois connection in the case that N is closed unde...
متن کاملConnectedness, Disconnectedness and Closure Operators: Further Results
Let X be an arbitrary category with an (E,M)-factorization structure for sinks. A notion of constant morphism that depends on a chosen class of monomorphisms was previously used to provide a generalization of the connectedness-disconnectedness Galois connection (also called torsion-torsion free in algebraic contexts). This Galois connection was shown to factor throught the class of all closure ...
متن کاملConnectedness, Disconnectedness and Closure Operators, a More General Approach
Let X be an arbitrary category with an (E,M)-factorization structure for sinks. A notion of constant morphism that depends on a chosen class of monomorphisms is introduced. This notion yields a Galois connection that can be seen as a generalization of the classical connectedness-disconnectedness correspondence (also called torsion-torsion free in algebraic contexts). It is shown that this Galoi...
متن کاملSupporting Disconnectedness-Transparent Information Delivery for Mobile and Invisible Computing
As computing devices become ubiquitous and increasingly mobile, it is becoming apparent that the directed peerto-peer communication model has shortcomings for many forms of distributed interprocess communication. Undirected communication, including content-based messaging, is becoming increasingly common. This paper examines the issues involved in supporting content-based messaging to both mobi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2000
ISSN: 0167-2789
DOI: 10.1016/s0167-2789(99)00228-6